var crypto/rsa.bigOne

11 uses

	crypto/rsa (current package)
		rsa.go#L42: var bigOne = big.NewInt(1)
		rsa.go#L239: 	modulus := new(big.Int).Set(bigOne)
		rsa.go#L242: 		if prime.Cmp(bigOne) <= 0 {
		rsa.go#L260: 		pminus1 := new(big.Int).Sub(prime, bigOne)
		rsa.go#L262: 		if congruence.Cmp(bigOne) != 0 {
		rsa.go#L411: 		n := new(big.Int).Set(bigOne)
		rsa.go#L412: 		totient := new(big.Int).Set(bigOne)
		rsa.go#L416: 			pminus1.Sub(prime, bigOne)
		rsa.go#L610: 	priv.Precomputed.Dp = new(big.Int).Sub(priv.Primes[0], bigOne)
		rsa.go#L613: 	priv.Precomputed.Dq = new(big.Int).Sub(priv.Primes[1], bigOne)
		rsa.go#L624: 		values.Exp = new(big.Int).Sub(prime, bigOne)